Bounds for the Minimum Eigenvalue of
نویسنده
چکیده
In a recent paper Melman 12] derived upper bounds for the smallest eigen-value of a real symmetric Toeplitz matrix in terms of the smallest roots of rational and polynomial approximations of the secular equation f() = 0, the best of which being constructed by the (1; 2)-Pad e approximation of f. In this paper we prove that this bound is the smallest eigenvalue of the projection of the given eigenvalue problem onto a Krylov space of T ?1 n of dimension 3. This interpretation of the bound suggests enhanced bounds of increasing accuracy. They can be substantially improved further by exploiting symmetry properties of the principal eigenvector of T n .
منابع مشابه
Bounds for the Co-PI index of a graph
In this paper, we present some inequalities for the Co-PI index involving the some topological indices, the number of vertices and edges, and the maximum degree. After that, we give a result for trees. In addition, we give some inequalities for the largest eigenvalue of the Co-PI matrix of G.
متن کاملSome New Bounds on the Minimum Eigenvalue of Nonsingular M -Matrices
If A is a nonsingular M -matrix, some new upper and lower bounds on the minimum eigenvalue τ(A) of A are given. These bounds improve some results of Tian and Huang and are more accurate than Li et al. in some cases. In addition, we obtain some new bounds on the minimum eigenvalue of a nonsingular M -matrix A , which can give affirmative conclusions about whether bounds for the minimum eigenvalu...
متن کاملEla Some New Lower Bounds for the Minimum Eigenvalue of the Hadamard Product of an M-matrix and Its Inverse
Abstract. For the Hadamard product A ◦ A of an M -matrix A and its inverse A, some new lower bounds for the minimum eigenvalue of A ◦ A are given. These bounds improve the results of [H.B. Li, T.Z. Huang, S.Q. Shen, and H. Li. Lower bounds for the minimum eigenvalue of Hadamard product of an M -matrix and its inverse. Linear Algebra Appl., 420:235-247, 2007] and [Y.T. Li, F.B. Chen, and D.F. Wa...
متن کاملEigenvalue bounds on the pseudocodeword weight of expander codes
Four different ways of obtaining low-density parity-check codes from expander graphs are considered. For each case, lower bounds on the minimum stopping set size and the minimum pseudocodeword weight of expander (LDPC) codes are derived. These bounds are compared with the known eigenvalue-based lower bounds on the minimum distance of expander codes. Furthermore, Tanner’s parity-oriented eigenva...
متن کاملOn Complementary Distance Signless Laplacian Spectral Radius and Energy of Graphs
Let $D$ be a diameter and $d_G(v_i, v_j)$ be the distance between the vertices $v_i$ and $v_j$ of a connected graph $G$. The complementary distance signless Laplacian matrix of a graph $G$ is $CDL^+(G)=[c_{ij}]$ in which $c_{ij}=1+D-d_G(v_i, v_j)$ if $ineq j$ and $c_{ii}=sum_{j=1}^{n}(1+D-d_G(v_i, v_j))$. The complementary transmission $CT_G(v)$ of a vertex $v$ is defined as $CT_G(v)=sum_{u in ...
متن کاملInequalities for the minimum eigenvalue of M-matrices
Let A be a nonsingular M -matrix, and τ(A) denote its minimum eigenvalue. Shivakumar et al. [SIAM J. Matrix Anal. Appl., 17(2):298-312, 1996] presented some bounds of τ(A) when A is a weakly chained diagonally dominant M -matrix. The present paper establishes some new bounds of τ(A) for a general nonsingular M -matrix A. Numerical examples show that the results obtained are an improvement over ...
متن کامل